Search results for "general satisfiability"

showing 1 items of 1 documents

Two-variable First-Order Logic with Counting in Forests

2018

We consider an extension of two-variable, first-order logic with counting quantifiers and arbitrarily many unary and binary predicates, in which one distinguished predicate is interpreted as the mother-daughter relation in an unranked forest. We show that both the finite satisfiability and the general satisfiability problems for the extended logic are decidable in NExpTime. We also show that the decision procedure for finite satisfiability can be extended to the logic where two distinguished predicates are interpreted as the mother-daughter relations in two independent forests.

Variable (computer science)general satisfiabilityfinite satisfiabilitylogic and computational complexitydecision proceduresArithmetictwo-variable logic with counting quantifiersunranked trees/forestsMathematicsFirst-order logicEPiC Series in Computing
researchProduct